Entangling Problem Hamiltonian for Adiabatic Quantum Computation

نویسندگان

چکیده

Adiabatic quantum computation starts from embedding a computational problem into Hamiltonian whose ground state encodes the solution to problem. This is normally chosen be diagonal in basis, that product basis for qubits. We demonstrate that, fact, can always non-diagonal basis. To more precise, we show how construct such way all its excited states are entangled with respect qubit tensor structure, while still of form and conjecture entangling Hamiltonians might evade many-body localization bottleneck adiabatic thus improve performance.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Neuromorphic Adiabatic Quantum Computation

Real parallel computing is possible with a quantum computer which makes use of quantum states (Nielsen & Chuang, 2000). It is well known that a quantum computation algorithm for factorization discovered by Shor (1994) is faster than any classical algorithm. Also a quantum algorithm for database search in ( ) O N quantum computation steps instead of O(N) classical steps has been proposed by Grov...

متن کامل

Feedback-controlled adiabatic quantum computation

We propose a simple feedback-control scheme for adiabatic quantum computation with superconducting flux qubits. The proposed method makes use of existing on-chip hardware to monitor the ground-state curvature, which is then used to control the computation speed to maximize the success probability. We show that this scheme can provide a polynomial speed-up in performance and that it is possible ...

متن کامل

Quantum Computation by Adiabatic Evolution

We give a quantum algorithm for solving instances of the satisfiability problem, based on adiabatic evolution. The evolution of the quantum state is governed by a time-dependent Hamiltonian that interpolates between an initial Hamiltonian, whose ground state is easy to construct, and a final Hamiltonian, whose ground state encodes the satisfying assignment. To ensure that the system evolves to ...

متن کامل

Error Correcting Codes For Adiabatic Quantum Computation

Recently, there has been growing interest in using adiabatic quantum computation as an architecture for experimentally realizable quantum computers. One of the reasons for this is the idea that the energy gap should provide some inherent resistance to noise. It is now known that universal quantum computation can be achieved adiabatically using 2-local Hamiltonians. The energy gap in these Hamil...

متن کامل

Leveraging Adiabatic Quantum Computation for Election Forecasting

Accurate, reliable sampling from fully-connected graphs with arbitrary correlations is a difficult problem. Such sampling requires knowledge of the probabilities of observing every possible state of a graph. As graph size grows, the number of model states becomes intractably large and efficient computation requires full sampling be replaced with heuristics and algorithms that are only approxima...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lobachevskii Journal of Mathematics

سال: 2022

ISSN: ['1995-0802', '1818-9962']

DOI: https://doi.org/10.1134/s1995080222100262